Use of Eigenvector Centrality to Detect Graph Isomorphism
نویسنده
چکیده
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to determine whether or not two graphs are isomorphic (i.e., structurally the same). In this research, we propose to use the sequence (either the non-decreasing or nonincreasing order) of eigenvector centrality (EVC) values of the vertices of two graphs as a precursor step to decide whether or not to further conduct tests for graph isomorphism. The eigenvector centrality of a vertex in a graph is a measure of the degree of the vertex as well as the degrees of its neighbors. We hypothesize that if the non-increasing (or non-decreasing) order of listings of the EVC values of the vertices of two test graphs are not the same, then the two graphs are not isomorphic. If two test graphs have an identical non-increasing order of the EVC sequence, then they are declared to be potentially isomorphic and confirmed through additional heuristics. We test our hypothesis on random graphs (generated according to the Erdos-Renyi model) and we observe the hypothesis to be indeed true: graph pairs that have the same sequence of non-increasing order of EVC values have been confirmed to be isomorphic using the well-known Nauty software.
منابع مشابه
Discriminating Power of the Eigenvector Centrality Measure to Detect Graph Isomorphism
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to determine whether or not two graphs are isomorphic (i.e., structurally the same). In this paper, we analyze the discriminating power of the well-known centrali...
متن کاملComparative analysis of organizational processes by the use of the social network concepts
This study presents a comparative analysis of redesigned models of organizational processes by making use of social network concepts. After doing re-engineering of organizational processes which had been conducted in the headquarters of Mazandaran Province Education Department, different methods were used which included the alpha algorithm, alpha⁺, genetics and heuristics. Every one of these me...
متن کاملGeneral Centrality in a hypergraph
The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality measurement for a graph. We’ll use this measurement to say more about the number of communications in a hypergraph, to implement a learning mechanism, and to con...
متن کاملA note on a generalization of eigenvector centrality for bipartite graphs and applications
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need to design rating systems for bipartite graph models of time-sensitive and other processes. The linear algebra connection and some applications are described.
متن کاملEigenvector Centrality: Illustrations Supporting the Utility of Extracting More Than One Eigenvector to Obtain Additional Insights into Networks and Interdependent Structures
Among the many centrality indices used to detect structures of actors’ positions in networks is the use of the first eigenvector of an adjacency matrix that captures the connections among the actors. This research considers the seeming pervasive current practice of using only the first eigenvector. It is shows that, as in other statistical applications of eigenvectors, subsequent vectors can al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1511.06620 شماره
صفحات -
تاریخ انتشار 2015